Avoiding Bias in Boolean Network Statistical Studies
نویسنده
چکیده
Stuart Kauffman and others have proposed Random Boolean networks (RBN) as models of genetic regulation in living cells. Common practice in statistical studies of RBN ensembles has been to sample Boolean rules without explicit concern for their effective connectance . We show that this practice may lead to substantial bias in estimating important dynamical features of the sparselyconnected nets which have been of particular interest. We present exact formulas for (1) the number of distinct network state transition maps as a function of the numbers of elements (N) and nominal inputs (Kn); and (2) the number of rules by effective connectance (Ke), given Kn. We introduce the concept of multiplicity, relating the numbers of nominal and effective mappings, and show how to partition an ensemble into equal-multiplicity sub-ensembles. The necessary (exact) formulas are provided. This approach enables fine-grained assessment of dynamical features and construction of unbiased estimates with respect to the overall ensemble. We illustrate how the formulas apply to ensembles with Kn = 1 and Kn = 2. Our results may be relevant to any study that employs samples of sparsely-connected Boolean nets
منابع مشابه
Antichaos in a Class of Random Boolean Cellular Automata
A variant of Kauffman’s model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman’s except for a small bias in favor of boolean gates that depend on at most one input. The bias is asymptotic to 0 as the number of gates increases. Upper bounds on the time until the network reaches a state cycle and the size of the state cycle, as functi...
متن کاملAntichaos in a class of random boolean cellular automata
A variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean gates that depend on at most one input. The bias is asymptotic to 0 as the number of gates increases. Upper bounds on the time until the network reaches a state cycle and the size of the state cycle, as functi...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملMolecular network control through boolean canalization
Boolean networks are an important class of computational models for molecular interaction networks. Boolean canalization, a type of hierarchical clustering of the inputs of a Boolean function, has been extensively studied in the context of network modeling where each layer of canalization adds a degree of stability in the dynamics of the network. Recently, dynamic network control approaches hav...
متن کاملRecent Results on Ordering Parameters in Boolean Networks
The dynamics of discrete mathematical systems can be related to the values of certain ordering parameters. Experiments with the total set of possible structures of a boolean network with six elements and extended sets of two-valued boolean functions show that three simple parameters describing the topology, the bias of boolean functions, and their canalyzing potential yield necessary conditions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000